K-Nodes Multicasting Minimum Cost Spanning Trees in Wireless Mobile Ad Hoc Network(MANET)
نویسندگان
چکیده
منابع مشابه
Routing and Multicasting Strategies in Wireless Mobile Ad Hoc Networks
of the Dissertation Routing and Multicasting Strategies in Wireless Mobile Ad hoc Networks
متن کاملImproving Minimum Cost Spanning Trees by Upgrading Nodes
We study budget constrained network upgrading problems. We are given an undirected edge weighted graph G V E where node v V can be upgraded at a cost of c v . This upgrade reduces the weight of each edge incident on v. The goal is to find a minimum cost set of nodes to be upgraded so that the resulting network has a minimum spanning tree of weight no more than a given budget D. The results obta...
متن کاملMulticasting Techniques in Mobile Ad Hoc Networks
Multicasting is the transmission of packets to a group of zero or more hosts identi ed by a single destination address Multicasting is intended for group oriented computing Typically the members of a host group is dynamic that is hosts may join and leave groups at any time There is no restriction on the location or number of members in a host group A host may be a member of more than one group ...
متن کاملMulticasting in mobile ad-hoc network
Mobile ad-hoc network is a short live temporary network established by two or more mobile nodes in the absence of any supporting infrastructure. Routing is one of the core issues in this type of network. Effort is going on to invent a suitable routing strategy for mobile ad-hoc network. Good numbers of papers have been reported proposing various thoughts and solutions. The contribution of this ...
متن کاملMinimum energy-cost broadcast routing in ad hoc wireless networks
In this paper, we discuss energy efficient broadcast in ad hoc wireless networks. The problem of our concern is: given an ad hoc wireless network, to find a broadcast tree such that the energy cost of the broadcast tree is minimized. Each node in the network is assumed to have a fixed level of transmission power. We first prove that the problem is NP-hard, and propose three heuristic algorithms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2010
ISSN: 0975-8887
DOI: 10.5120/110-225